Which sequences are orbits?
نویسندگان
چکیده
Abstract In the study of discrete dynamical systems, we typically start with a function from space into itself, and ask questions about properties sequences iterates function. this paper reverse direction study. particular, restricting to complex plane, sequence numbers functions (if any) for which is an orbit under iteration. This gives rise existence uniqueness. We resolve some questions, show that these issues can be quite delicate.
منابع مشابه
Which elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملMultilinear forms which are products of linear forms
The conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. Also we generalize a result due to S.Kurepa for 2n-functionals in a group G.
متن کاملWhich graphs are pluperfect?
A graph G is pluperfect if one can add new multiple edges to obtain a multi graph M satisfying: (1) G spans M, (2) the degrees of the nodes of M are consecutive integers, (3) G and M have the same minimum degree. Our purpose is to display several families of pluperfect graphs in order to L Introduction My good friends Mehdi Behzad and Gary Chartrand wrote a note [1] titled "No graph is perfect"...
متن کاملWhich Nestohedra Are Removahedra?
A removahedron is a polytope obtained by deleting inequalities from the facet description of the classical permutahedron. Relevant examples range from the associahedra to the permutahedron itself, which raises the natural question to characterize which nestohedra can be realized as removahedra. In this note, we show that the nested complex of any connected building set closed under intersection...
متن کاملWhich digraphs are round?
A digraph D is round if the vertices of D can be circularly ordered as VI, V2, ... , Vn so that, for each vertex Vi, the out-neighbours of Vi appear consecutively following Vi and the in-neighbours of Vi appear consecutively preceding Vi in the ordering. We characterize round digraphs in terms of forbidden substructures. Our proof implies a polynomial algorithm to decide if a digraph is round.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis and Mathematical Physics
سال: 2021
ISSN: ['1664-2368', '1664-235X']
DOI: https://doi.org/10.1007/s13324-021-00493-5